type internal/sync.entry

19 uses

	internal/sync (current package)
		hashtriemap.go#L143: 	var oldEntry *entry[K, V]
		hashtriemap.go#L167: func (ht *HashTrieMap[K, V]) expand(oldEntry, newEntry *entry[K, V], newHash uintptr, hashShift uint, parent *indirect[K, V]) *node[K, V] {
		hashtriemap.go#L252: 	var oldEntry *entry[K, V]
		hashtriemap.go#L564: type entry[K comparable, V any] struct {
		hashtriemap.go#L566: 	overflow atomic.Pointer[entry[K, V]] // Overflow for hash collisions.
		hashtriemap.go#L571: func newEntryNode[K comparable, V any](key K, value V) *entry[K, V] {
		hashtriemap.go#L572: 	return &entry[K, V]{
		hashtriemap.go#L579: func (e *entry[K, V]) lookup(key K) (V, bool) {
		hashtriemap.go#L589: func (e *entry[K, V]) lookupWithValue(key K, value V, valEqual equalFunc) (V, bool) {
		hashtriemap.go#L603: func (head *entry[K, V]) swap(key K, new V) (*entry[K, V], V, bool) {
		hashtriemap.go#L632: func (head *entry[K, V]) compareAndSwap(key K, old, new V, valEqual equalFunc) (*entry[K, V], bool) {
		hashtriemap.go#L660: func (head *entry[K, V]) loadAndDelete(key K) (V, *entry[K, V], bool) {
		hashtriemap.go#L682: func (head *entry[K, V]) compareAndDelete(key K, value V, valEqual equalFunc) (*entry[K, V], bool) {
		hashtriemap.go#L706: func (n *node[K, V]) entry() *entry[K, V] {
		hashtriemap.go#L710: 	return (*entry[K, V])(unsafe.Pointer(n))

The pages are generated with Golds v0.7.6. (GOOS=linux GOARCH=amd64)